When Modified Gram-schmidt Generates a Well-conditioned Set of Vectors
نویسنده
چکیده
Orthogonalization methods play a key role in many iterative methods. In this paper, we establish new properties for the modified Gram-Schmidt algorithm. We show why the modified Gram-Schmidt algorithm generates a well-conditioned set of vectors. This result holds under the assumption that the initial matrix is not “too ill-conditioned” in a way that is quantified. As a consequence we show that if two iterations of the algorithm are performed, the resulting algorithm produces a matrix whose columns are orthogonal up to machine precision. Finally we illustrate through a numerical experiment the sharpness of our result.
منابع مشابه
A reorthogonalization procedure for modified Gram–Schmidt algorithm based on a rank-k update
The modified Gram–Schmidt algorithm is a well–known and widely used procedure to orthogonalize the column vectors of a given matrix. When applied to ill–conditioned matrices in floating point arithmetic, the orthogonality among the computed vectors may be lost. In this work, we propose an a posteriori reorthogonalization technique based on a rank–k update of the computed vectors. The level of o...
متن کاملA Rank-k Update Procedure for Reorthogonalizing the Orthogonal Factor from Modified Gram-Schmidt
The modified Gram–Schmidt algorithm is a well-known and widely used procedure to orthogonalize the column vectors of a given matrix. When applied to ill-conditioned matrices in floating point arithmetic, the orthogonality among the computed vectors may be lost. In this work, we propose an a posteriori reorthogonalization technique based on a rank-k update of the computed vectors. The level of o...
متن کاملGram–Schmidt Process in Different Parallel Platforms
Important operations in numerical computing are vector orthogonalization. One of the well-known algorithms for vector orthogonalisation is Gram–Schmidt algorithm. This is a method for constructing a set of orthogonal vectors in an inner product space, most commonly the Euclidean space Rn. This process takes a finite, linearly independent set S = {b1, b2, ..., bk} vectors for k ≤ n and generates...
متن کاملAnother Proof for Modified Gram-schmidt with Reorthogonalization
In this note, we consider the modified Gram-Schmidt algorithm with reorthogonalization applied on a numerical nonsingular matrix, we explain why the resulting set of vectors is orthogonal up to the machine precision level. To establish this result, we show that a certain L-criterion is necessarily verified after the second reorthogonalization step, then we prove that this L-criterion implies th...
متن کاملEnhanced Gram-Schmidt Process for Improving the Stability in Signal and Image Processing
The Gram-Schmidt Process (GSP) is used to convert a non-orthogonal basis (a set of linearly independent vectors) into an orthonormal basis (a set of orthogonal, unit-length vectors). The process consists of taking each vector and then subtracting the elements in common with the previous vectors. This paper introduces an Enhanced version of the Gram-Schmidt Process (EGSP) with inverse, which is ...
متن کامل